- associative array processor
- Engineering: AAP
Универсальный русско-английский словарь. Академик.ру. 2011.
associative array processor
Смотреть что такое "associative array processor" в других словарях:
Judy array — In computer science and software engineering, a Judy array is a complex but very fast associative array data structure for storing and looking up values using integer or string keys. Unlike arrays, Judy arrays may be sparse; that is, they may… … Wikipedia
Content Addressable Parallel Processor — A Content Addressable Parallel Processor (CAPP) is a type of parallel processor which uses content addressing memory (CAM) principles. CAPPs are intended for bulk computation. The syntactic structure of their computing algorithm are simple,… … Wikipedia
LNCS216 — Ch. Fernstrom/I. Kruzela/B. Svensson: LUCAS Associative Array Processor Design, Programming and Application Studies, Springer Verlag 1986 … Acronyms
LNCS216 — Ch. Fernstrom/I. Kruzela/B. Svensson: LUCAS Associative Array Processor Design, Programming and Application Studies, Springer Verlag 1986 … Acronyms von A bis Z
Hash table — Not to be confused with Hash list or Hash tree. Unordered map redirects here. For the proposed C++ class, see unordered map (C++). Hash Table Type unsorted dictionary Invented 1953 Time complexity in big O notation Average Worst case Space … Wikipedia
Content-addressable memory — (CAM) is a special type of computer memory used in certain very high speed searching applications. It is also known as associative memory, associative storage, or associative array, although the last term is more often used for a programming data … Wikipedia
D (programming language) — For other programming languages named D, see D (disambiguation)#Computing. D programming language Paradigm(s) multi paradigm: imperative, object oriented, functional, meta Appeared in 1999 (1999) Designed by … Wikipedia
Pointer (computing) — This article is about the programming data type. For the input interface (for example a computer mouse), see Pointing device. Pointer a pointing to the memory address associated with variable b. Note that in this particular diagram, the computing … Wikipedia
Algorithmic efficiency — In computer science, efficiency is used to describe properties of an algorithm relating to how much of various types of resources it consumes. Algorithmic efficiency can be thought of as analogous to engineering productivity for a repeating or… … Wikipedia
Double-ended queue — Not to be confused with Double ended priority queue. In computer science, a double ended queue (dequeue, often abbreviated to deque, pronounced deck) is an abstract data structure that implements a queue for which elements can only be added to or … Wikipedia
Word (computer architecture) — Processors 1 bit 4 bit 8 bit 12 bit 16 bit 18 bit 24 bit 31 bit 32 bit 36 bit 48 bit 60 bit … Wikipedia
